Distributed Cyclic Reference Counting
نویسندگان
چکیده
We present a distributed cyclic reference counting algorithm which incorporates both, the correct management of cyclic data structures and the improvement of lazy mark-scan. The algorithm allows processors to run local mark-scan simultaneously without any need of synchronisation between phases of di erent local mark-scans either on the same processor or on di erent processors.
منابع مشابه
A Survey of Distributed Garbage Collection Techniques
We present the spectrum of distributed garbage collection techniques. We rst describe those reference counting-based techniques and compare them, in particular with respect to resilience to message failures. Reference counting-based techniques are acyclic since they are unable to collect cyclic data structures. We then describe a number of hybrid schemes improving over distributed reference cou...
متن کامل4.2 Improvement of Eciency 5 Problems and Its Solution 5.1 Specifying Groups 5.2 Unpredictable Cycles
Reference counting schemes are suitable for garbage collection on distributed systems because they do not require global information to nd garbage. However, reference counting schemes have a serious drawback: they cannot reclaim garbage which form cyclic structures. In this paper, we propose an extension of the traditional reference counting scheme, group reference counting, which alleviates th...
متن کاملPractical Distributed Garbage Collection for Networks with Synchronous Clocks and Message Delay
Distributed garbage collection over a message passage network i s discussed in this paper. Traditionally, this can be done b y reference counting, which is fast but cannot reclaim cyclic structures or b y graph traversal, e.g. mark-and-sweep or time stamping, which is capable of reclaiming cyclic structures but is slow. We propose a combined scheme which is fast in reclaiming acyclic garbage an...
متن کاملCyclic Weighted Reference Counting without Delay
Weighted Reference Counting is a low communication distributed storage reclamation scheme for loosely-couple multiprocessors. The algorithm we present herein extends weighted reference counting to allow the collection of cyclic data structures. To do so, the algorithm identiies candidate objects that may be part of cycles and performs a tricolour mark-scan on their subgraph in a lazy manner to ...
متن کاملCyclic Distributed Garbage Collection Without Global Synchronization in CORBA
1 Abstract This paper describes an algorithm for cyclic distributed garbage collection and its implementation. The algorithm is an extension of reference-listing that collects cyclic garbage. It uses back-tracing instead of mark-and-sweep to eliminate the need of global synchronization. First, by using a special heuristic the algorithm chooses an object that is likely to be garbage (suspect). T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994